A Descriptor Solution to a Class of Discrete Distance Problems
نویسنده
چکیده
Hankel norm and Nehari-type approximation problems arise in model reduction and H1-control theory. Existing solutions to the discrete-time version of these problems may be derived using a standard state-space framework, but the resulting solution formulas require an invertible A-matrix. As a further complication, the D-matrix in the representation formula for all solutions becomes unbounded in the optimal case. The aim of this paper is to show that both these complications may be removed by analyzing these problems in a descriptor framework.
منابع مشابه
A novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملPartial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback
A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملA Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems
In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...
متن کاملExact Implementation of Multiple Initial Conditions in the DQ Solution of Higher-Order ODEs
The differential quadrature method (DQM) is one of the most elegant and useful approximate methods for solving initial and/or boundary value problems. It is easy to use and also straightforward to implement. However, the conventional DQM is well-known to have some difficulty in implementing multiple initial and/or boundary conditions at a given discrete point. To overcome this difficulty, this ...
متن کامل